Online scheduling to minimize modified total tardiness with an availability constraint
نویسندگان
چکیده
منابع مشابه
Single Machine Group Scheduling with Setups to Minimize Total Tardiness
This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...
متن کاملScheduling a variant of flowshop problems to minimize total tardiness
This paper studies no-wait flowshop scheduling problems to minimize total tardiness. This paper mathematically formulates the problem as an effective mixed integer linear programming model. Moreover, this paper proposes solution methods based on variable neighborhood search and simulated annealing algorithms. Besides, some well-known heuristics of classical flow shops are adapted to the case of...
متن کاملScheduling preemptive open shops to minimize total tardiness
This article considers the problem of scheduling preemptive open shops to minimize total tardiness. The problem is known to be NP-hard. An efficient constructive heuristic is developed for solving large-sized problems. A branch-and-bound algorithm that incorporates a lower bound scheme based on the solution of an assignment problem as well as various dominance rules are presented for solving me...
متن کاملScheduling on parallel identical machines to minimize total tardiness
This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on r...
متن کاملPlanning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. We consider two objectives: minimizing the number of late tasks, and minimizing total tardiness. Our main theoretical contribution is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.055